On the Shapley Value of Unrooted Phylogenetic Trees
نویسندگان
چکیده
منابع مشابه
On the Shapley Value of Unrooted Phylogenetic Trees.
The Shapley value, a solution concept from cooperative game theory, has recently been considered for both unrooted and rooted phylogenetic trees. Here, we focus on the Shapley value of unrooted trees and first revisit the so-called split counts of a phylogenetic tree and the Shapley transformation matrix that allows for the calculation of the Shapley value from the edge lengths of a tree. We sh...
متن کاملThe Shapley Value of Phylogenetic Trees
Every weighted tree corresponds naturally to a cooperative game that we call a tree game; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species and this assignment captures the diversity present in the coalition of species considered. We consider the Shapley value of tree games and ...
متن کاملCompatibility of unrooted phylogenetic trees is FPT
A collection of T1, T2, . . . , Tk of unrooted, leaf labelled (phylogenetic) trees, all with different leaf sets, is said to be compatible if there exists a tree T such that each tree Ti can be obtained from T by deleting leaves and contracting edges. Determining compatibility is NP-hard, and the fastest algorithm to date has worst case complexity of around (nk) time, n being the number of leav...
متن کاملGraph triangulations and the compatibility of unrooted phylogenetic trees
We characterize the compatibility of a collection of unrooted phylogenetic trees as a question of determining whether a graph derived from these trees — the display graph — has a specific kind of triangulation, which we call legal. Our result is a counterpart to the well known triangulation-based characterization of the compatibility of undirected multi-state characters.
متن کاملThe agreement problem for unrooted phylogenetic trees is FPT
A collection T of k unrooted phylogenetic trees on different leaf sets is said to be strictly compatible or in agreement if there exists a tree T such that each tree in T can be obtained from T by deleting leaves and suppressing degree-2 vertices. The problem of determining if a set of unrooted trees is in agreement has been proved NP-hard in 1992. Here, we show that an f(k) · n algorithm exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Biology
سال: 2018
ISSN: 0092-8240,1522-9602
DOI: 10.1007/s11538-018-0392-8